Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
31	C:uments and Settingsc. documentoscheTt 27, 1T.dvi Add to Reading List Source URL: personales.upv.es Language: English - Date: 2004-02-19 03:12:54 Genetic algorithms Applied mathematics Operations research Mathematics Cybernetics Computational complexity theory NP-complete problems Mathematical optimization Crossover Chromosome Mutation Vehicle routing problem
32	comput. complex), 281 – 040281–27 DOIs00037c Birkh¨ Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:22 Computational complexity theory Graph theory NP-complete problems Mathematics Travelling salesman problem Set TSP problem Steiner tree problem Vertex cover Approximation algorithm APX Cut Time complexity
33	Optimal Gradient-Based Learning Using Importance Weights Sepp Hochreiter and Klaus Obermayer Bernstein Center for Computational Neuroscience and Technische Universit¨at Berlin Add to Reading List Source URL: www.bioinf.jku.at Language: English - Date: 2013-01-23 02:39:45 Artificial neural networks Artificial intelligence Learning Applied mathematics Recurrent neural network Long short-term memory Sepp Hochreiter Backpropagation Vanishing gradient problem Supervised learning Support vector machine Generalization error
34	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 1, 2011 Problem Set 1 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-02-07 15:14:45 Analysis of algorithms Computational complexity theory Time complexity Computer science Algorithm Mathematics Academia Oblivious data structure
35	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:33 Graph theory Mathematics Computational complexity theory NP-hard problems NP-complete problems Edsger W. Dijkstra Combinatorial optimization Approximation algorithms Travelling salesman problem Shortest path problem Matching Randomized algorithm
36	Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomized Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2013-11-25 11:07:04 Analysis of algorithms Online algorithms Finite fields Computer science Computational complexity theory XTR List update problem Competitive analysis Applied mathematics
37	Mining Relations from Git Commit Messages — an Experience Report Rikard Andersson∗ , Morgan Ericsson†∗ , Anna Wingkvist† ∗ Chalmers \| University of Gothenburg Gothenburg, Sweden Add to Reading List Source URL: www2.lingfil.uu.se Language: English - Date: 2014-10-16 02:36:21 Linguistics Language Cognitive science Computational linguistics Natural language processing Named-entity recognition Relex Information extraction Statistical classification P versus NP problem Part-of-speech tagging Syntax
38	VIRGINIA SPACE GRANT - STUDENT RESEARCH CONFERENCEValidation Framework for Multiprocessor and Distributed Scheduling Algorithms Add to Reading List Source URL: www.vsgc.odu.edu Language: English - Date: 2013-05-02 13:43:42 Computational complexity theory Operations research Mathematics Theory of computation Mathematical optimization Optimization problem Algorithm Time complexity Evolutionary multimodal optimization Global optimization
39	Semantically Conditioned LSTM-based Natural Language Generation for Spoken Dialogue Systems Tsung-Hsien Wen, Milica Gaˇsi´c, Nikola Mrkˇsi´c, Pei-Hao Su, David Vandyke and Steve Young Cambridge University Engineering Add to Reading List Source URL: www.emnlp2015.org Language: English - Date: 2015-12-05 04:22:52 Artificial neural networks Artificial intelligence Machine learning Computational neuroscience Academia Deep learning Long short-term memory Recurrent neural network Sepp Hochreiter Vanishing gradient problem Speech recognition Handwriting recognition
40	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree